Design and Performance Analysis of CBCS Packet Scheduling Algorithm

In active and programmable networks, packet processing could be accomplished in the router within the data path. For efficient resource allocation in such networks, the packet scheduling schemes should consider multiple resources such as CPU and memory in addition to the bandwidth to improve overall performance. The dynamic nature of network load and the inherent unpredictability of processing times of active packets pose a significant challenge in CPU scheduling. It has been identified that unlike bandwidth scheduling, prior estimation of CPU requirements of a packet is very difficult since it is platform dependent and it also depends on processing load at the time of execution and operating system scheduling etc. This paper presents a new composite scheduling algorithm called CBCS WFQ which is based on Weighted Fair Queuing (WFQ) and is designed for scheduling both bandwidth and CPU resources adaptively, fairly and efficiently. CBCS WFQ uses an adaptive prediction technique for estimating the processing requirements of active flows efficiently and accurately. Through simulation and analysis works we show the improved performance of our scheduling algorithm in achieving better delay guarantees compared to WFQ if used separately for CPU and Bandwidth scheduling.